Signal Reconstruction Errors in Jittered Sampling
نویسندگان
چکیده
منابع مشابه
Linear Signal Reconstruction from Jittered Sampling
This paper presents an accurate and simple method to evaluate the performance of AD/DA converters affected by clock jitter, which is based on the analysis of the mean square error (MSE) between the reconstructed signal and the original one. Using an approximation of the linear minimum MSE (LMMSE) filter as reconstruction technique, we derive analytic expressions of the MSE. Through asymptotic a...
متن کاملCorrelated Multi-Jittered Sampling
Image synthesis techniques requiringMonteCarlo integration frequentlyneed to generate uniformly distributed samples within the unit hypercube. The ideal sample generation method will maximize the variance reduction as the numberof samples increases. Strati cationvia jittering is one simple, tractable, R. L. Cook. Stochastic sampling in computer graphics. ACM Transactions on Graphics, 5(1):51–72...
متن کاملGibbs Sampling for Signal Reconstruction
This paper describes the use of stochastic simulation techniques to reconstruct biomedical signals not directly measurable. In particular, a deconvolution problem with an uncertain clearance parameter is considered. The problem is addressed using a Monte Carlo Markov Chain method, called the Gibbs Sampling, in which the joint posterior probability distribution of the stochastic parameters is es...
متن کاملSimply denoise: wavefield reconstruction via jittered undersampling
In this paper, we present a new discrete undersampling scheme designed to favor wavefield reconstruction by sparsity-promoting inversion with transform elements that are localized in the Fourier domain. Our work is motivated by empirical observations in the seismic community, corroborated by recent results from compressive sampling, which indicate favorable (wavefield) reconstructions from rand...
متن کاملOn the discrepancy of jittered sampling
We study the discrepancy of jittered sampling: a jittered sampling set P ⊂ [0, 1]d is generated for fixed m ∈ N by partitioning [0, 1]d into md axis aligned cubes of equal measure and placing a random point inside each of the N = md cubes. We prove that, for N sufficiently large, 1 10 d N 1 2 + 1 2d ≤ ED∗ N (P) ≤ √ d(logN) 1 2
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2009
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2009.2027404